On graphs whose local subgraphs are strongly regular with parameters (144, 39, 6, 12)
نویسندگان
چکیده
منابع مشابه
Strongly Regular Graphs with Parameters . . .
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m, 2m +m, m +m, m +m). Strongly regular graphs with these parameters have been called max energy graphs, because they have maximal energy (as defined by ...
متن کاملSome Induced Subgraphs of Strongly Regular Graphs with no Triangles
Let G be a strongly regular graph with no triangles (SRNT graph) with the parameters (n, k, 0, μ) , if v is a vertex of G, a subgraph which induced by the set of vertices at distance one denoted by G1(v) and subgraph which induced by the set of vertices at distance two denoted by G2(v). In this paper we introduce and study the subgraph which induced by the set U and denoted by G2(U) where, U ca...
متن کاملRegular graphs whose subgraphs tend to be acyclic
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , δ > 0 and any integer d ≥ 2, explicit or randomized constructions of d-regular graphs on n > n0( , δ) vertices in which a random subgraph obtained by retaining each edge, randomly and independently, with probability ρ = 1− d−1 , is acyclic with probability at least 1 − δ. On the other hand ...
متن کاملSome strongly regular graphs with the parameters of Paley graphs
We construct two-intersection sets in PG(5, q), q odd, admitting PSL(2, q), whose associated strongly regular graphs have the same parameters as, but are not isomorphic to, Paley graphs.
متن کاملParallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
Let = (X,R) be a distance-regular graph of diameter d . A parallelogram of length i is a 4-tuple xyzw consisting of vertices of such that ∂(x, y)= ∂(z,w)= 1, ∂(x, z)= i, and ∂(x,w)= ∂(y,w)= ∂(y, z)= i− 1. A subset Y of X is said to be a completely regular code if the numbers πi,j = | j (x)∩ Y | (i, j ∈ {0,1, . . . , d}) depend only on i = ∂(x,Y ) and j . A subset Y of X is said to be strongly c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doklady Mathematics
سال: 2014
ISSN: 1064-5624,1531-8362
DOI: 10.1134/s1064562414020343